Improvement of Committee Machine Performance to Solve Multiple Response Optimization Problems
نویسندگان
چکیده
Three phases are considered for multiple response optimization (MRO) problems. They are design of experiments, modeling and optimization. Committee machines (CM) as a set of some experts such as some artificial neural networks (ANNs) can be applied for modeling phase. Then, genetic algorithm (GA) determines the final solution with object maximizing the global desirability as optimization phase. That algorithm was implemented on five MRO case studies include target, minimizing and maximizing objects. Current article is a development of recent authors' work on application of CM in MRO problem solving. Initial approach in that work, includes a committee machine with four different ANNs. The CM weights are specified with GA which its fitness function was minimizing the overall RMSE for each response. In current work, a new approach was applies in finding the committee machine weights. The fitness function in this approach is made by minimizing the absolute error between CM responses and real data for each response, separately. A performance index is defined to evaluate different models performance. The results from five case studies show that there are noticeable decreasing in overall RMSE whereas there is a negligible decreasing in GD for new CM with respect to initial CM. this is due that less error is a confirmation of performance increasing for new committee machine. Index Term-Global desirability, Committee Machine, Multiple responses optimization, Genetic Algorithm
منابع مشابه
Quality Improvement Through Multiple Response Optimization (TECHNICAL NOTE)
The performance of a product is often evaluated by several quality characteristics. ptimizing the manufacturing process with respect to only one quality characteristic will not always lead to the optimum values for other characteristics. Hence, it would be desirable to improve the overall quality of a product by improving quality characteristics, which are considered to be important. The probl...
متن کاملA Hybrid Optimization Algorithm for Learning Deep Models
Deep learning is one of the subsets of machine learning that is widely used in Artificial Intelligence (AI) field such as natural language processing and machine vision. The learning algorithms require optimization in multiple aspects. Generally, model-based inferences need to solve an optimized problem. In deep learning, the most important problem that can be solved by optimization is neural n...
متن کاملA Hybrid Optimization Algorithm for Learning Deep Models
Deep learning is one of the subsets of machine learning that is widely used in Artificial Intelligence (AI) field such as natural language processing and machine vision. The learning algorithms require optimization in multiple aspects. Generally, model-based inferences need to solve an optimized problem. In deep learning, the most important problem that can be solved by optimization is neural n...
متن کاملOptimal Design of a Microgrid with Multiple Energies Considering Reliability
The unprecedented penetration of distributed generation in distribution network provides utilities with a unique opportunity to manage portions of networks as microgrids (MG). The implementation of an MG may offer many benefits, such as capital investments deferral, reduction of greenhouse gas emissions, improvement in reliability, and reduction in network losses. In order to draw the most effe...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013